Automating the Schema Matching Process for Heterogeneous Data Warehouses
نویسندگان
چکیده
A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In order to enable the translation of queries in a federated approach, schemas of the federated and the local warehouses must be matched. In this paper we present a procedure that enables the matching process for schema structures specific to the multidimensional model of data warehouses: facts, measures, dimensions, aggregation levels and dimensional attributes. Similarities between warehouse-specific structures are computed by using linguistic and structural comparison, where calculated values are used to create necessary mappings. We present restriction rules and recommendations for aggregation level matching, which builds the most complex part of the process. A software implementation of the entire process is provided in order to perform its verification, as well as to determine the proper selection metric for mapping different multidimensional structures.
منابع مشابه
An Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملissues in database schema evolution : the road not taken Working Paper # 2003 - 15
Dynamic schema evolution is the ability of the database schema to evolve by incorporating changes to its structure without loss of existing data and without significantly affecting the dayto-day operations of the database. A very large body of literature exists today reflecting the extensive work addressing schema evolution and its management. Schema evolution has three well-defined and inter-r...
متن کاملXML Data Warehouse: Modelling and Querying
A large amount of heterogeneous information is now available in enterprises. Some their data sources are repositories of XML data or they are viewed as XML data independently on their inner implementation. In this paper, we study the foundations of XML data warehouses. We adapt the traditional star schema with explicit dimension hierarchies for XML environment. We propose the notion of XML-refe...
متن کاملAn Approach for Matching Schemas of Heterogeneous Relational Databases
AbstrAct: Schema matching is a basic problem in many database application domains, such as data integration. The problem of schema matching can be formulated as follows, " given two schemas, S i and S j , find the most plausible correspondences between the elements of S i and S j , exploiting all available information, such as the schemas, instance data, and auxiliary sources " [24]. Given the ...
متن کاملP . A . Bernstein , Industrial Strength Schema Matching 1 Industrial Strength Schema Matching
The problem of creating mappings between schemas is an unavoidable and time-consuming step in the design of many types of large-scale commercial applications: in transaction processing and enterprise application integration, to help map messages between different XML formats; in data warehouses, to map data sources into warehouse schemas; and in web portals, to identify points of integration be...
متن کامل